The unprovability of small inconsistency

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Proving Unprovability

There may be differences between this version and the published version. You are advised to consult the publisher's version if you wish to cite from it.

متن کامل

Unprovability Results Involving Braids

We construct long sequences of braids that are descending with respect to the standard order of braids (“Dehornoy order”), and we deduce that, contrary to all usual algebraic properties of braids, certain simple combinatorial statements involving the braid order are true, but not provable in the subsystems IΣ1 or IΣ2 of the standard Peano system. It has been known for decades that there exist s...

متن کامل

Several proofs of PA-unprovability

In this article we give unprovability proofs of several combinatorial statements using the method of indiscernibles. Our first two statements are strong versions of KM (the Kanamori-McAloon principle) and KM(2), (the Kanamori-McAloon principle for pairs) that both allow unexpectedly simple proofs. We proceed to discuss results by A.Weiermann and G.Lee on IΣkprovability/unprovability of the prin...

متن کامل

Unprovability of the Logical Characterization of Bisimulation

We quickly review labelled Markov processes (LMP) and provide a counterexample showing that in general measurable spaces, event bisimilarity and state bisimilarity differ in LMP. This shows that the logic in Desharnais [3] does not characterize state bisimulation in non-analytic measurable spaces. Furthermore we show that, under current foundations of Mathematics, such logical characterization ...

متن کامل

Brief Introduction to Unprovability

The article starts with a brief survey of Unprovability Theory as of summer 2006. Then, as an illustration of the subject’s model-theoretic methods, we re-prove threshold versions of unprovability results for the Paris-Harrington Principle and the Kanamori-McAloon Principle using indiscernibles. In addition, we obtain a short accessible proof of unprovability of the ParisHarrington Principle. T...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Archive for Mathematical Logic

سال: 1993

ISSN: 0933-5846,1432-0665

DOI: 10.1007/bf01387407